Methods for Computing B-isdn Link Blocking Probabilities
نویسندگان
چکیده
Sándor Molnár Technical University of Budapest Department of Telecommunications and Telematics Sztoczek u. 2 H-1111 Budapest, Hungary Tel: + 36 1 1813 500/24 71 Fax: + 36 1 1812 302 E-mail: [email protected] Søren Blaabjerg Ellemtel Telecommunication Systems Laboratories Scheelevägen 17 S-223 70 Lund Sweden Tel: + 46 46 18 57 66 Fax: + 46 46 18 57 61 E-mail: Soren.Blaabjerg@ eua.ericsson.se
منابع مشابه
Mathematical model of service quality performance’s computing of multiservice network
This article devoted to effectiveness of multiservice networks’ functioning in order to provide the quality of these networks. Problem of the probability-time characteristics (PTC) of the network’s calculation represents the designers of most interest. Solution of this problem gives you opportunity to: significantly improve network performance, prevent network failures during overload traffic i...
متن کاملComputing Call Blocking Probabilities in Wavelength Routing Networks
YUHONG ZHU. Computing Call Blocking Probabilities in Wavelength Routing Networks. (Under the direction of Dr. Harry G. Perros and Dr. George N. Rouskas.) We study a class of circuit switched wavelength routing networks with xed or alternate routing, with or without converts, and with various wavelength allocation policies. We rst construct an exact Markov process and an approximate Markov proce...
متن کاملA Comparison of Approximation Algorithms for Blocking Probabilities on Telecommunication System with Trunk Reservation Access Policy
It has widely known that the irreversible property of Markov chain representing the multirate multiservice loss system with Trunk Reservation policy is not satisfied. In this case, the well-known product form result for state probabilities cannot be applied. To obtain the exact state probabilities, one has to solve the balance equation of Markov chain that represents the system. But this is imp...
متن کاملVirtual Circuit Blocking Probabilities in an ATM Banyan Network with b×b Switching Elements∗
This paper presents the trade-offs that exist between the blocking probability, the size of the switching elements, the offered load and the link capacities in an ATM-based Banyan multistage interconnection network for QoS-sensitive applications. We present a quasi-analytical study which indicates that, as the link capacity between switching elements is increased, the blocking probability reduc...
متن کاملComputing call-blocking probabilities in LEO satellite constellations
We present an analytical model for computing call-blocking probabilities in a low earth orbit (LEO) satellite network that carries voice calls. Both satelliteand earth-fixed constellations with interorbit links and handoffs are considered. In this model, we assume a single beam per satellite. Also, we assume that call arrivals are Poisson with a fixed arrival rate that is independent of the geo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007